Minimum Cut of Directed Planar Graphs in O(n log log n) Time
نویسندگان
چکیده
We give an O(n log log n) time algorithm for computing the minimum cut (or equivalently, the shortest cycle) of a weighted directed planar graph. This improves the previous fastest O(n log n) solution [SODA’04]. Interestingly, while in undirected planar graphs both min-cut and min st-cut have O(n log log n) solutions [ESA’11, STOC’11], in directed planar graphs our result makes min-cut faster than min st-cut, which currently requires O(n log n) [J. ACM’09].
منابع مشابه
Faster shortest paths in dense distance graphs, with applications
We show how to combine two techniques for efficiently computing shortest paths in directed planar graphs. The first is the linear-time shortest-path algorithm of Henzinger, Klein, Subramanian, and Rao [STOC’94]. The second is Fakcharoenphol and Rao’s algorithm [FOCS’01] for emulating Dijkstra’s algorithm on the dense distance graph (DDG). A DDG is defined for a decomposition of a planar graph G...
متن کاملGlobal minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, our algorithm computes the minimum cut in gO(g)n log log n time, matching the running time of the fastest algorithm known for planar graphs, due to Łącki and Sankowski, for any constant g. Indeed, our algorithm calls Ł...
متن کاملMinimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths
Let G be an n-node simple directed planar graph with nonnegative edge weights. We study the fundamental problems of computing (1) a global cut of Gwith minimum weight and (2) a cycle of G with minimum weight. The best previously known algorithm for the former problem, running in O(n log n) time, can be obtained from the algorithm of Łącki, Nussbaum, Sankowski, and Wulff-Nilsen for single-source...
متن کاملMinimum s-t cut in undirected planar graphs when the source and the sink are close
Consider the minimum s − t cut problem in an embedded undirected planar graph. Let p be the minimum number of faces that a curve from s to t passes through. If p = 1, that is, the vertices s and t are on the boundary of the same face, then the minimum cut can be found in O(n) time. For general planar graphs this cut can be found in O(n log n) time. We unify these results and give an O(n log p) ...
متن کاملDirected domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کامل